Towards Inductive Support Logic Programming

نویسندگان

  • J. F. Baldwin
  • T. P. Martin
چکیده

Support logic programming and its practical implementation (Fril) integrates probabilistic and fuzzy uncertainty into logic programming using mass assignments. This paper presents a snapshot of current research, aimed at combining the best aspects of inductive logic programming with the uncertainty representation of Fril to create a sophisticated and novel approach to knowledge discovery. An example is given showing how a supported Fril rule can be extracted from uncertain Fril relations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Methodology for Rst Order Learning: a Case Study

Many well-known learning systems like CN2 and C4.5 use an attribute-value representation for the examples. In Inductive Logic Programming (ILP) a rst-order logical formalism is used, which is a more expressive representation. We will introduce a 5-step methodology to upgrade an existing propositional learner towards a rst-order learning system. The system ICL (Inductive Classiication Logic) is ...

متن کامل

A Comparative Study of Inductive Logic Programming Methods for Software Fault Prediction

We evaluate inductive logic programming (ILP) methods for predicting fault density in C++ classes. In this problem, each training example is a C++ class deenition, represented as a calling tree, and labeled as \pos-itive" ii faults (i.e., errors) were discovered in its implementation. We compare two ILP systems, FOIL and FLIPPER, and explore the reasons for their diiering performance, using bot...

متن کامل

Support Vector Inductive Logic Programming

In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP). We propose a general method for constructing kernels for Support Vector Inductive Logic Programming (SVILP). The kernel not only captures the semantic and syntactic relational information contained in the data but also provi...

متن کامل

kFOIL: Learning Simple Relational Kernels

A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FOIL with kernel methods. The feature space is constructed by leveraging FOIL search for a set of relevant clauses. The search is driven by the performance obtained by a support vector machine based on the resulting kern...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001